Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing

Source URL: acmccs.github.io

DRE-ip: A Verifiable E-Voting Scheme without Tallying Authorities? Siamak F. Shahandashti and Feng Hao School of Computing Science, Newcastle University, UK {siamak.shahandashti,feng.hao}@ncl.ac.uk

Source URL: eprint.iacr.org

• Voting
• Politics
• Electronic voting
• Election technology
• Electoral fraud
• Punchscan
• Scantegrity
• Voting machine
• Ballot
• Bingo voting
• End-to-end auditable voting systems
• Voter-verified paper audit trail

Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing∗ Changyu Dong† Newcastle University Newcastle Upon Tyne, UK

Source URL: arxiv.org

Verifiable Programming of Object-Oriented and Distributed Systems∗ Olaf Owe University of Oslo, Department of Informatics, Oslo, Norway, and University of California, Santa Cruz, Department of Computer Science, USA Apr

Source URL: heim.ifi.uio.no

• Software engineering
• Computer programming
• Computing
• Object-oriented programming
• Software design patterns
• Concurrent programming languages
• Cross-platform software
• Method
• Objective-C
• Invariant
• Null Object pattern
• Protocol

Verifiable Computation Advisor(s): Daniel Slamanig Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria Motivation

Source URL: www.iaik.tugraz.at

• Distributed computing
• Secure communication
• Verifiable computing
• Cloud computing
• Institute for Applied Information Processing and Communications
• Deliverable

Declarative Verifiable SDI Specifications Rick McGeer US Ignite ABSTRACT

Source URL: spw16.langsec.org

• Theoretical computer science
• Formal methods
• Formal verification
• Software-defined networking
• Software verification
• Turing machine
• Finite-state machine
• Model checking
• Temporal logic
• OpenFlow
• Computer science
• Distributed computing

Homomorphic Signatures for Verifiable Computing Advisor(s): Christian Hanser Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria

Source URL: www.iaik.tugraz.at

• Public-key cryptography
• Coding theory
• Finite fields
• Information theory
• Linear network coding
• Wireless sensor network
• RSA
• Digital signature
• Homomorphism
• Homomorphic encryption

Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions? Veronika Kuchta and Mark Manulis Department of Computing, University of Surrey, United Kingdom , mark@manulis

Source URL: manulis.eu

Robustness and device independence of verifiable blind quantum computing Alexandru Gheorghiu,1 Elham Kashefi,1, 2 and Petros Wallden1 2 1 School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh EH8

Source URL: 2015.qcrypt.net

Appeared in the 23rd Annual IFIP WG 11.3 Working Conference on Data and Application Security, 2009, pp. 252–267. Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols using Trusted Computing Te

Source URL: www.uncg.edu